Precise Calling Context Encoding

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Context-sensitive analysis without calling-context

Since Sharir and Pnueli, algorithms for context-sensitivity have been defined in terms of ‘valid’ paths in an interprocedural flow graph. The definition of valid paths requires atomic call and ret statements, and encapsulated procedures. Thus, the resulting algorithms are not directly applicable when behavior similar to call and ret instructions may be realized using non-atomic statements, or w...

متن کامل

Efficient, Context-Sensitive Dynamic Analysis via Calling Context Uptrees

State-of-the-art dynamic bug detectors such as data race and memory leak detectors report program locations that are likely causes of bugs. However, static program location is not enough for developers to understand the behavior of increasingly complex and concurrent software. Dynamic calling context provides additional information, but it is expensive to record calling context frequently, e.g....

متن کامل

Termination Analysis with Calling Context Graphs

We introduce calling context graphs and various static and theorem proving based analyses that together provide a powerful method for proving termination of programs written in feature-rich, first order, functional programming languages. In contrast to previous work, our method is highly automated and handles any source of looping behavior in such languages, including recursive definitions, mut...

متن کامل

Context-dependent stopper encoding

Abstra t. A hara ter-based en oding method is presented for naturallanguage texts and geneti data. Exa t string mat hing from the en oded text is faster than from the original text, with medium and longer patterns. A ompression ratio of about 50% is a hieved as a by-produ t. The method en odes hara ters with variable-length odewords of 2-bit base symbols. An advan ed variant is ontext-dependent...

متن کامل

Probabilistic Calling Context and Efficient Call-Trace Collection CS701

This lecture concerns the material in two papers: “Probabilistic Calling Context” by Bond and McKinley [3], and “Efficient Call-Trace Collection” by Wu et al. [5].

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Software Engineering

سال: 2012

ISSN: 0098-5589

DOI: 10.1109/tse.2011.70